High Capacity Watermarking in Nonedge Texture Under Statistical Distortion Constraint

نویسندگان

  • Fan Zhang
  • Wenyu Liu
  • Chunxiao Liu
چکیده

High-capacity image watermarking scheme aims at maximize bit rate of hiding information, neither eliciting perceptible image distortion nor facilitating special watermark attack. Texture, in preattentive vision, delivers itself by concise high-order statistics, and holds high capacity for watermark. However, traditional distortion constraint, e.g. just-noticeable-distortion (JND), cannot evaluate texture distortion in visual perception and thus imposes too strict constraint. Inspired by recent work of image representation [9], which suggests texture extraction and mix probability principal component analysis for learning texture feature, we propose a distortion measure in the subspace spanned by texture principal components, and an adaptive distortion constraint depending on image local roughness. The proposed spread-spectrum watermarking scheme generates watermarked images with larger SNR than JND-based schemes at the same distortion level allowed, and its watermark has a power spectrum approximately directly proportional to the host image’s and thereby more robust against Wiener filtering attack.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Intelligent Modified Difference Expansion for Reversible Watermarking

A Reversible Watermarking (RW) using Difference Expansion (DE) algorithm plays an important role on content authentication for highly secured medical and military images. According to this algorithm, the least significant bit (LSB) of inter-pixel differences (between a pair of neighboring pixel) is used to embed secret data. It is seen that none of the DE works focuses on structural information...

متن کامل

An Information-Theoretic Model for Image Watermarking and Data Hiding

An information–theoretic model for image watermarking and data hiding systems is presented in this paper. The fundamental capacity limits of these systems are determined by the statistical model used for the host image, by the distortion constraints on the data hider and the attacker, and by the information available to the data hider, to the attacker, and to the decoder. We consider wavelet st...

متن کامل

A framework for evaluating the data-hiding capacity of image sources

An information-theoretic model for image watermarking and data hiding is presented in this paper. Previous theoretical results are used to characterize the fundamental capacity limits of image watermarking and data-hiding systems. Capacity is determined by the statistical model used for the host image, by the distortion constraints on the data hider and the attacker, and by the information avai...

متن کامل

Joint Compression and Digital Watermarking: Information-Theoretic Study and Algorithms Development

In digital watermarking, a watermark is embedded into a covertext in such a way that the resulting watermarked signal is robust to certain distortion caused by either standard data processing in a friendly environment or malicious attacks in an unfriendly environment. The watermarked signal can then be used for different purposes ranging from copyright protection, data authentication, fingerpri...

متن کامل

Analysis of digital watermarks subjected to optimum linear filtering and additive noise

s: English and German provided Tables: None Figures: 15 Galley proofs: Please send galley proofs to J. K. Su at the MIT Lincoln Laboratory address given above. Telephone: +1-781-981-4188, fax: +1-781-981-7271, email: [email protected]. Abstract Using a theoretical approach based on random processes, signal processing, and information theory, we study the performance of digital watermarks subjected ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007